Chain Resolution for the Semantic Web
Identifieur interne : 006C28 ( Main/Exploration ); précédent : 006C27; suivant : 006C29Chain Resolution for the Semantic Web
Auteurs : Tanel Tammet [Estonie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general schema for applying resolution provers and propose a new search strategy ”chain resolution” tailored for large ontologies. Chain resolution is an extension of the standard resolution algorithm. The main idea of the extension is to treat binary clauses of the general form A(x) ∨ B(x) with a special chain resolution mechanism, which is different from standard resolution used otherwise. Chain resolution significantly reduces the size of the search space for problems containing a large number of simple implications, typically arising from taxonomies. Finally we present a compilation-based schema for practical application of resolution-based methods as inference engines for Semantic Web queries.
Url:
DOI: 10.1007/978-3-540-25984-8_21
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002320
- to stream Istex, to step Curation: 002289
- to stream Istex, to step Checkpoint: 001837
- to stream Main, to step Merge: 006F32
- to stream Main, to step Curation: 006C28
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Chain Resolution for the Semantic Web</title><author><name sortKey="Tammet, Tanel" sort="Tammet, Tanel" uniqKey="Tammet T" first="Tanel" last="Tammet">Tanel Tammet</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:96B3F194B53A4B7F8C0EA17AE31A9F345B15E61B</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-25984-8_21</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-G6VG3CC3-T/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002320</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002320</idno><idno type="wicri:Area/Istex/Curation">002289</idno><idno type="wicri:Area/Istex/Checkpoint">001837</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001837</idno><idno type="wicri:doubleKey">0302-9743:2004:Tammet T:chain:resolution:for</idno><idno type="wicri:Area/Main/Merge">006F32</idno><idno type="wicri:Area/Main/Curation">006C28</idno><idno type="wicri:Area/Main/Exploration">006C28</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Chain Resolution for the Semantic Web</title><author><name sortKey="Tammet, Tanel" sort="Tammet, Tanel" uniqKey="Tammet T" first="Tanel" last="Tammet">Tanel Tammet</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Estonie</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general schema for applying resolution provers and propose a new search strategy ”chain resolution” tailored for large ontologies. Chain resolution is an extension of the standard resolution algorithm. The main idea of the extension is to treat binary clauses of the general form A(x) ∨ B(x) with a special chain resolution mechanism, which is different from standard resolution used otherwise. Chain resolution significantly reduces the size of the search space for problems containing a large number of simple implications, typically arising from taxonomies. Finally we present a compilation-based schema for practical application of resolution-based methods as inference engines for Semantic Web queries.</div></front></TEI><affiliations><list><country><li>Estonie</li></country></list><tree><country name="Estonie"><noRegion><name sortKey="Tammet, Tanel" sort="Tammet, Tanel" uniqKey="Tammet T" first="Tanel" last="Tammet">Tanel Tammet</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006C28 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006C28 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:96B3F194B53A4B7F8C0EA17AE31A9F345B15E61B
|texte= Chain Resolution for the Semantic Web
}}
| This area was generated with Dilib version V0.6.33. |  |